Gossip on Weighted Networks

نویسندگان

  • Mursel Tasgin
  • Haluk Bingol
چکیده

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about the structure of a network. We analyze gossip spreading on real weighted networks of human interactions. 6 co-occurrence and 7 social pattern networks are investigated. Gossip propagation is found to be a good parameter to distinguish co-occurrence and social pattern networks. As a comparison some miscellaneous networks and computer generated networks based on ER, BA, WS models are also investigated. They are found to be quite different than the human interaction networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 20 1 . 03 75 v 1 [ cs . S I ] 1 J an 2 01 2 Gossip on Weighted Networks

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

متن کامل

ar X iv : 1 20 1 . 03 75 v 2 [ cs . S I ] 5 M ay 2 01 2 Gossip on Weighted Networks

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1201.0375  شماره 

صفحات  -

تاریخ انتشار 2012